Implementing X
نویسندگان
چکیده
This paper presents a term graph rewriting system as an implementation for the X -calculus, a substitution-free language that can be used to describe the behaviour of functional programming languages at a very low level of granularity, and has first been defined in [10,1]. Since the calculus has a notion of binding, in the context of sharing a notion of rebinding is introduced that helps avoid double binding of names.
منابع مشابه
The x-Kernel: An Architecture for Implementing Network Protocols
A!Nract-This paper describes a new operating system kernel, called the x-kernel, that provides an explicit architecture for constructing and composing network protocols. Our experience implementing and evaluating several protocols in the x-kernel shows that this architecture is both general enough to accommodate a wide range of protocols, yet efficient enough to perform competitively with less ...
متن کاملTurner Syndrome: A Unique Mosaic Case with 45,X/47,XX,+21/46,XX Cell Lines
We report an extremely rare case of Turner syndrome mosaicism in a 30-year-old woman. At least 100 metaphases were observed and analyzed through GTG banding with over 550 band resolutions observed. G-banded chromosome analysis revealed a mosaic female karyotype involving 3 different cell lines. One cell line (90% of the analyzed metaphases) presented monosomy X, while 6% of the cells showed tri...
متن کاملJonah: Experience Implementing PKIX Reference Freeware
IBM made a business decision to promote an open, secure, interoperable and integrateable environment by embracing the IETF’s Public Key Infrastructure (X.509) standards, developing a reference implementation of the core set, and giving it away as freeware. We discuss the architecture of this reference code, emphasizing lessons learned from implementing the standards in an integrated PKI system.
متن کاملX-KIF – New Knowledge Modeling Language
This paper proposes X-KIF – a new modeling language intended for implementing large, formal knowledge bases. The language originated from the SUO-KIF language, which has been used for implementing a large family of ontologies based on the Suggested Upper Merged Ontology (SUMO). We address some of the problems with the SUO-KIF language, and try to formally define the semantics of some higher-ord...
متن کاملInvestigating the Replica Transfer Scheduling Problem
The Replica Placement Problem (RPP) aims at selecting the nodes for duplicating data objects in order to optimize their access. Even though a lot of work already exists on RPP, the issue of implementing the resulting allocation scheme is typically overlooked. In this paper we introduce the Replica Transfer Scheduling Problem (RTSP), briefly stated as: given a network of servers with limited sto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 127 شماره
صفحات -
تاریخ انتشار 2005